Correlations in connected random graphs
نویسندگان
چکیده
منابع مشابه
Highly connected random geometric graphs
Let P be a Poisson process of intensity one in a square Sn of area n. We construct a random geometric graph Gn,k by joining each point of P to its k nearest neighbours. For many applications it is desirable that Gn,k is highly connected, that is, it remains connected even after the removal of a small number of its vertices. In this paper we relate the study of the s-connectivity of Gn,k to our ...
متن کامل3-Connected Cores In Random Planar Graphs
The study of the structural properties of large random planar graphs has become in recent years a field of intense research in computer science and discrete mathematics. Nowadays, a random planar graph is an important and challenging model for evaluating methods that are developed to study properties of random graphs from classes with structural side constraints. In this paper we focus on the s...
متن کاملDegree Correlations in Random Geometric Graphs
Spatially embedded networks are important in several disciplines. The prototypical spatial network we assume is the Random Geometric Graph, of which many properties are known. Here we present new results for the two-point degree correlation function in terms of the clustering coefficient of the graphs for two-dimensional space in particular, with extensions to arbitrary finite dimensions.
متن کاملRandom Lifts of Graphs are Highly Connected
In this note we study asymptotic properties of random lifts of graphs introduced by Amit and Linial as a new model of random graphs. Given a base graph G and an integer n, a random lift of G is obtained by replacing each vertex of G by a set of n vertices, and joining these sets by random matchings whenever the corresponding vertices of G are adjacent. In this paper we study connectivity proper...
متن کاملSets that are connected in two random graphs
We consider two random graphs G1, G2 from the Gn,p=c/n model, both on the same vertex set. We ask whether there is a non-trivial set of vertices S, so that S induces a connected subgraph both in G1 and in G2. We determine the threshold for the appearance of such a subset, as well as the size of such a subset. This has applications to the study of frozen vertices in k-colourings of a random grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2008
ISSN: 1539-3755,1550-2376
DOI: 10.1103/physreve.77.036124